Non-Horn clause logic programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meta-Programming for Generalized Horn Clause Logic

In conventional logic programming systems, control information is expressed by clause and goal order and by purely procedural constructs, e.g., the Prolog cut. This approach destroys the equivalence of declarative and procedural semantics in logic programs. In this paper, we argue that in order to comply with the logic programming paradigm, control information should also be expressed declarati...

متن کامل

Higher-Order Horn Logic Programming

We describe a fragment of higher-order Horn logic which can be used as a higher-order extension of Prolog. It allows the programmer to axiomatize predicates of predicates and operations on predicates. The restrictions defining the fragment ensure that the higher-order predicates and operations defined are monotonic and continuous—that they are enumeration operators. As a result, the fragment is...

متن کامل

Operational Semantics of Resolution in Horn Clause Logic

This paper presents a study of operational and type-theoretic properties of different resolution strategies in Horn clause logic. We distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by term-matching, the recently introduced structural resolution, and partial (or lazy) resolution. We express them all uniformly as abstract reduction systems, w...

متن کامل

A General Similarity Framework for Horn Clause Logic

First-Order Logic formulæ are a powerful representation formalism characterized by the use of relations, that cause serious computational problems due to the phenomenon of indeterminacy (various portions of one description are possibly mapped in different ways onto another description). Being able to identify the correct corresponding parts of two descriptions would help to tackle the problem: ...

متن کامل

Translating a detailed linguistic semantic representation into Horn clause logic

From the semantic representation produced by TANKA, a domain-independent, knowledge-scant, and interactive natural language analyzer, we construct Horn clauses which represent the facts or rules found in technical texts, specifically legal texts. This article describes the conversion process and the way it takes into account the detailed structure returned by the analyzer, a precise syntacticse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1997

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(97)00007-6